Orderings for Innermost Termination
نویسندگان
چکیده
This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity , IP-monotonicity for short. This property may lead to several innermost-specific orderings. Here, an IP-monotonic version of the Recursive Path Ordering is presented. This variant can be used (directly or as ingredient of the Dependency Pairs method) for proving innermost termination of non-terminating term rewrite systems.
منابع مشابه
Termination of term rewriting using dependency pairs
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left-and right-hand sides of rewrite rules, but introduce the notion of dependency pairs to compare left-hand sides with special subterms of the right-hand sides. This results in a technique which allows to apply existing methods for...
متن کاملModular Termination Proofs for Rewriting Using Dependency Pairs
Recently, Arts and Giesl developed the dependency pair approach which allows automated termination and innermost termination proofs for many term rewriting systems (TRSs) for which such proofs were not possible before. The motivation for this approach was that virtually all previous techniques for automated termination proofs of TRSs were based on simplification orderings. In practice, however,...
متن کاملTermination of Non-simple Rewrite Systems
Rewriting is a computational process in which one term is derived from another by replacing a subterm with another subterm in accordance with a set of rules. If such a set of rules (rewrite system) has the property that no derivation can continue indefinitely, it is said to be terminating. Showing termination is an important component of theorem proving and of great interest in programming lang...
متن کاملTermination of Non-simple Rewrite Systems by Charles
Rewriting is a computational process in which one term is derived from another by replacing a subterm with another subterm in accordance with a set of rules. If such a set of rules rewrite system has the property that no derivation can continue indeenitely, it is said to be terminating. Showing termination is an important component of theorem proving and of great interest in programming languag...
متن کاملRelating Innermost, Weak, Uniform and Modular Termination of Term Rewriting Systems
Term rewriting systems play an important role in various areas, e.g. in abstract data type speciications, for automated theorem proving and as a basic computation model for functional programming languages. In theory and practice, one of the most important properties of term rewriting systems is the strong normalization or ((nite or uniform) termination property which is undecidable in general....
متن کامل